Unsourced Massive Random Access Scheme Exploiting Reed-Muller Sequences

The challenge in massive Machine Type Communication (mMTC) is to support reliable and instant access for an enormous number of machine-type devices (MTDs). In some particular applications mMTC, the point (AP) only has know messages received, but not where they source from, thus giving rise concept unsourced random (URA). this paper, we propose a novel URA scheme exploiting elegant properties Reed-Muller (RM) sequences. Specifically, after dividing message active user into several information chunks, RM sequences are used carry those vast sequence space improve spectral efficiency, their nested structure enable efficient detection. Next, further explore structural property designing sparse patterns which part serve as hints coupling chunks single user. factors affecting performance our slot-based detection characterized. Besides, complexity proposed stitching method analyzed compared commonly tree coding approach. Our simulation results verify enhanced error probability computational existing counterpart.